Riordan paths and derangements
نویسندگان
چکیده
منابع مشابه
Riordan paths and derangements
Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and (321, 31̄42)-avoiding derangements. We also present a combinatorial proof of a recurrence relation for the Riordan numbers in the spirit of the Foata-Zeilberger proof of a recurrence relation on the Schröder numbers.
متن کاملGeneralized Narayana Polynomials, Riordan Arrays, and Lattice Paths
We study a family of polynomials in two variables, identifying them as the moments of a two-parameter family of orthogonal polynomials. The coefficient array of these orthogonal polynomials is shown to be an ordinary Riordan array. We express the generating function of the sequence of polynomials under study as a continued fraction, and determine the corresponding Hankel transform. An alternati...
متن کاملSemiorders and Riordan Numbers
In this paper, we define a class of semiorders (or unit interval orders) that arose in the context of polyhedral combinatorics. In the first section of the paper, we will present a pure counting argument equating the number of these interesting (connected and irredundant) semiorders on n + 1 elements with the nth Riordan number. In the second section, we will make explicit the relationship betw...
متن کاملOn Parallel Generation of Partial Derangements, Derangements and Permutations
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The representation is derived from a representation of permutations by iterative decomposition of symmetric permutation group Sn into cosets. New algorithms are proposed for generation of partial set derangements in t. The con...
متن کاملPell Walks and Riordan Matrices
The purpose of this paper is twofold. As the first goal, we show that three different classes of random walks are counted by the Pell numbers. The calculations are done using a convenient technique that involves the Riordan group. This leads to the second goal, which is to demonstrate this convenient technique. We also construct bijections among Pell, certain Motzkin, and certain Schröder walks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.05.001